Optimal data placement in two-headed disk systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Seek Distances in Two-Headed Disk Systems

We make a correction to the calculation of mean seek time in a recent algorithm of intelligently positioned two headed disk systems. We also introduce a new two headed disk system with better mean seek time.

متن کامل

Data placement schemes in replicated mirrored disk systems

In the present paper, we study the most frequent data placement schemes, i.e., the organ-pipe and camel arrangements, in a mirrored disk system which supports cylinder replication at appropriate locations across the disk surface. Five schemes are proposed to identify the appropriate replica positions for the most frequently accessed cylinders. Three schemes, which are called Left, Right and Sym...

متن کامل

Optimal Data Placement In

A problem inherent to the performance of disk systems is the data placement in cyinders in such a way that the seek time is minimized. If successive searchers are independent, then the optimal placement for conventional one-headed disk systems is the organ-pipe arrangement. According to this arrangement the most frequent cylinder is placed in the central location, while the less frequent cylind...

متن کامل

The Two Headed Disk: Stochastic Dominance of the Greedy Policy

In his paper “Should the two-headed disk be greedy? Yes, it should” Hofri defined a “greedy policy” as follows. Assuming that the range of disk addresses is [OJ], a request at location x is served by the closest arm while the other arm jockeys to a new position, z, where z = (1/3)x or z = 2/3 +x/3 depending on whether x is larger or smaller than l/2. Hofri proved that this policy minimizes the ...

متن کامل

Disk Subsystem Load Balancing : Disk Striping vs . Conventional Data Placement

The I/O subsystem is becoming a major bottleneck in an increasing number of computer systems. To provide improved I/O performance, as well as to accommodate growing storage requirements, disk subsystems are increasing in size. A major hurdle to obtaining the performance available from these large disk subsystems is load imbalance, or disk skew. Dynamic data placement, the conventional load bala...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BIT

سال: 1990

ISSN: 0006-3835,1572-9125

DOI: 10.1007/bf02017343